Some New Self-avoiding Walk and Polygon Models
نویسندگان
چکیده
We study the behaviour of prudent, perimeter and quasi-prudent self-avoiding walks and polygons in both two and three dimensions, as well as some solvable subsets. Our analysis combines exact solutions of some simpler cases, careful asymptotic analysis of functional equations which can be obtained in more complicated cases and extensive numerical studies based on exact series expansions for less tractable cases, augmented by long Monte Carlo runs in some cases.
منابع مشابه
On the scaling limit of planar self - avoiding walk
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and nondisconnecting...
متن کاملFunctional integral representations for self-avoiding walk
Abstract: We give a survey and unified treatment of functional integral representations for both simple random walk and some self-avoiding walk models, including models with strict self-avoidance, with weak selfavoidance, and a model of walks and loops. Our representation for the strictly self-avoiding walk is new. The representations have recently been used as the point of departure for rigoro...
متن کاملMonte Carlo Results for Projected Self-Avoiding Polygons: A Two-dimensional Model for Knotted Polymers
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of polymer passing on top of each other. Each polygon configuration can be viewed as the two-dimensional projection of a particular knot. We study numerically th...
متن کاملOn the Dominance of Trivial Knots among SAPs on a Cubic Lattice
The knotting probability is defined by the probability with which an N -step self-avoiding polygon (SAP) with a fixed type of knot appears in the configuration space. We evaluate these probabilities for some knot types on a simple cubic lattice. For the trivial knot, we find that the knotting probability decays much slower for the SAP on the cubic lattice than for continuum models of the SAP as...
متن کاملGable Roof Description by Self-Avoiding Polygon
In this paper, we present a Self-Avoiding Polygon (SAP) model for describing and detecting complex gable rooftops from nadir-view aerial imagery. We demonstrate that a broad range of gable rooftop shapes can be summarized as self-avoiding polygons, whose vertices correspond to roof corners. The SAP model, defined over the joint space of all possible SAPs and images, combines the shape prior emb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 117 شماره
صفحات -
تاریخ انتشار 2012